Simplifying conditional term rewriting systems : Unification, termination and confluence
نویسندگان
چکیده
منابع مشابه
Combinations of Simplifying Conditional Term Rewriting Systems
A conditional term rewriting system (CTRS) is called simplifying if there exists a simpliication ordering > on terms such that the left-hand side of any rewrite rule is greater than the right-hand side and the terms occurring in the conditions of that rule. If a simplifying join CTRS consists of nitely many rules, it is terminating and the applicability of a rewrite rule is decidable by recursi...
متن کاملTermination and Confluence in Infinitary Term Rewriting
The basic notions of the theory of term rewriting are defined for terms that may involve function letters of infinite arity. A sufficient condition for completeness is derived, and its use demonstrated by the example of abstract clones over infinitary signatures. Introduction In general, to see that two terms of some equational theory A are not equivalent requires a model of A in which their in...
متن کاملSyntactic Confluence Criteria for Positive/Negative-Conditional Term Rewriting Systems
We study the combination of the following already known ideas for showing confluence of unconditional or conditional term rewriting systems into practically more useful confluence criteria for conditional systems: Our syntactic separation into constructor and non-constructor symbols, Huet’s introduction and Toyama’s generalization of parallel closedness for non-terminating unconditional systems...
متن کاملSufficient Conditions for Modular Termination of Conditional Term Rewriting Systems
Recently we have shown the following abstract result for unconditional term rewriting systems (TRSs). Whenever the disjoint union R1 R2 of two ((nite) terminating TRSs R1, R2 is non-terminating, then one of the systems, say R1, enjoys an interesting property, namely it is not termination preserving under non-deterministic collapses, i.e. R1 fG(x;y) ! x;G(x; y) ! yg is non-terminating, and the o...
متن کاملNon-simplifying Graph Rewriting Termination
So far, a very large amount of work in Natural Language Processing (NLP) rely on trees as the core mathematical structure to represent linguistic informations (e.g. in Chomsky’s work). However, some linguistic phenomena do not cope properly with trees. In a former paper, we showed the benefit of encoding linguistic structures by graphs and of using graph rewriting rules to compute on those stru...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 1987
ISSN: 0747-7171
DOI: 10.1016/s0747-7171(87)80010-x